The Encrypted Elliptic Curve Hash
نویسنده
چکیده
Bellare and Micciancio’s MuHASH applies a pre-existing hash function to map indexed message blocks into a secure group. The resulting hash is the product. Bellare and Micciancio proved, in the random oracle model, that MuHASH is collision-resistant if the group’s discrete logarithm problem is infeasible. MuHASH, however, relies on a pre-existing hash being collision resistant. In this paper, we remove such a reliance by replacing the pre-existing hash with a block cipher under a fixed key. We adapt Bellare and Micciancio’s collision-resistance proof to the ideal cipher model. Preimage resistance requires us to add a further modification.
منابع مشابه
Achieving Authentication and Integrity using Elliptic Curve Cryptography Architecture
Communication security is one of the areas where research is highly required. The data used in communication is very sensitive and needs to be protected and made abstract from intruders of system. This research is all about securing the messages or data that is being communicated among two parties.The recent branch of Network security is Cryptography using Elliptic Curve Architectures which is ...
متن کاملA Stamped Blind Signature Scheme based on Elliptic Curve Discrete Logarithm Problem
Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collision-resistant cryptographic hash functions.
متن کاملOn the Performance of Provably Secure Hashing with Elliptic Curves
We propose a cryptographic hash function based on the difficulty of computing discrete logarithms in the group of points of an elliptic curve over a finite field. We prove the security of the hash function and analyze the performance. Our implementation of the finite field, the elliptic curve arithmetic, and scalar multiplication is optimized for high throughput on modern 32-bit desktop process...
متن کاملAn Indifferentiable Hash Function into Elliptic Curves
We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an elliptic-curve, for example Icart’s function or the Shallue-Woestijne-Ulas (SWU) algorithm.
متن کاملThe Research of Confidential Communication Based on the Elliptic Curve and the Combined Chaotic Mapping
This paper presents a new type of chaotic encryption system based on combined chaotic mapping pseudo-random number generator, Hash Table, and elliptic curve. In this program, the elliptic curve algorithm is used for the key distribution. After the linear transformation, the original chaotic sequence generated by drive system can be combined to chaotic mapping, converted to an encryption key seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008